RDF Modelling and SPARQL Processing of SQL Abstract Syntax Trees
نویسندگان
چکیده
Syntax Trees Corentin Follenfant, Olivier Corby, Fabien Gandon, and David Trastour 1 INRIA Sophia Antipolis Méditerranée [email protected] 2 SAP Research [email protected] Abstract. Most enterprise systems rely on relational databases, and therefore SQL queries, to populate dynamic documents such as business intelligence reports, dashboards or spreadsheets. These queries represent Most enterprise systems rely on relational databases, and therefore SQL queries, to populate dynamic documents such as business intelligence reports, dashboards or spreadsheets. These queries represent metadata about the documents, thus they can feed information retrieval systems such as recommender systems or search engines. In this paper we propose to automatically annotate documents with structured representations of their SQL queries expressed with RDF graphs. We show that SPARQL is a natural language to query these SQL queries, i.e. to perform meta-querying, and discuss challenges that arise from this approach.
منابع مشابه
An RDF Vocabulary for Meta-Programming with SPARQL Algebra
SPARQL queries can be represented in RDF in order to work with them as first-class citizen in Semantic Web applications. The representation used so far, SPIN SPARQL, closely follows the abstract syntax tree, but fails to directly capture the semantics and is hard to work with for query rewriting. Here a novel vocabulary based on SPARQL Algebra is presented. The adequacy of the language is empir...
متن کاملBitMat – Scalable Indexing and Querying of Large RDF Graphs
The growing size of Semantic Web data expressed in the form of Resource Description Framework (RDF) has made it necessary to develop effective ways of storing this data to save space and to query it in a scalable manner. SPARQL – the query language for RDF data – closely follows SQL syntax. As a natural consequence most of the RDF storage and querying engines are based on modern database storag...
متن کاملOperational Semantics for SPARQL Update
Concurrent fine grained updates are essential for using RDF stores in dynamic modern Web applications, where users increasingly contribute content as often as they read content. SPARQL Update is a language proposed by the W3C for fine grained updates for RDF stores. In this work we propose an operational semantics for an update language for RDF, which models core features of SPARQL Update. Firs...
متن کاملNamed graphs
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such named graphs. This enables RDF statements that describe graphs, which is beneficial in many Semantic Web application areas. Named graphs are given an abstract syntax, a formal semantics, an XML syntax, and a syntax based on N3. SPARQL is a query language applicable to ...
متن کاملS2RDF: RDF Querying with SPARQL on Spark
RDF has become very popular for semantic data publishing due to its flexible and universal graph-like data model. Thus, the ever-increasing size of RDF data collections raises the need for scalable distributed approaches. We endorse the usage of existing infrastructures for Big Data processing like Hadoop for this purpose. Yet, SPARQL query performance is a major challenge as Hadoop is not inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012